Cooperating Distributed Grammar Systems with Random Context Grammars as Components
نویسندگان
چکیده
In this paper, we discuss cooperating distributed grammar systems where components are (variants of) random context grammars. We give an overview of known results and open problems, and prove some further results.
منابع مشابه
Cooperating Distributed Grammar Systems with Permitting Grammars as Components
This paper studies cooperating distributed grammar systems working in the terminal derivation mode where the components are variants of permitting grammars. It proves that although the family of permitting languages is strictly included in the family of random context languages, the families of random context languages and languages generated by permitting cooperating distributed grammar system...
متن کاملOn the Terminating Derivation Mode in Cooperating Distributed Grammar Systems with Forbidding Components
This paper discusses the terminating derivation mode in cooperating distributed grammar systems where components are forbidding grammars instead of context-free grammars. Such systems are called forbidding cooperating distributed grammar systems, and it is demonstrated that the number of their components can be reduced to two without changing the generative power and that these systems are comp...
متن کاملCooperating distributed context-free hexagonal array grammar systems with permitting contexts
In this paper we associate permitting symbols with rules of Grammars in the components of cooperating distributed context-free hexagonal array grammar systems as a control mechanism and investigating the generative power of the resulting systems in the terminal mode. This feature of associating permitting symbols with rules when extended to patterns in the form of connected arrays also requires...
متن کاملCooperating distributed context-free hexagonal array grammar systems with permitting contexts
In this paper we associate permitting symbols with rules of Grammars in the components of cooperating distributed context-free hexagonal array grammar systems as a control mechanism and investigating the generative power of the resulting systems in the terminal mode. This feature of associating permitting symbols with rules when extended to patterns in the form of connected arrays also requires...
متن کاملCooperating Distributed Grammar Systems: Components with Nonincreasing Competence
We study the generative power of CD grammar systems (CDGSs) that use a cooperation protocol based on the level of competence on a sentential form — and the competence of their components does not increase during rewriting. A component of a CDGS is k-competent on a sentential form if it can rewrite exactly k different nonterminals appearing in that string. A CDGS with components that are nonincr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Acta Cybern.
دوره 20 شماره
صفحات -
تاریخ انتشار 2011